翻訳と辞書 Words near each other ・ Partial index ・ Partial integration ・ Partial integration (contract law) ・ Partial isometry ・ Partial k-tree ・ Partial least squares path modeling ・ Partial least squares regression ・ Partial leverage ・ Partial likelihood methods for panel data ・ Partial linear space ・ Partial list of Orthodox churches destroyed as part of the recovery of churches in the Second Republic ・ Partial melting ・ Partial molar property ・ Partial monosomy 13q ・ Partial Nuclear Test Ban Treaty ・ Partial order reduction ・ Partial oxidation ・ Partial Password ・ Partial payment ・ Partial permutation ・ Partial Portraits ・ Partial pressure ・ Partial productivity ・ Partial redundancy elimination ・ Partial regression plot ・ Partial residual plot ・ Partial response maximum likelihood ・ Partial return reverse swap ・ Partial seizure ・ Partial sorting Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Partial order reduction ： ウィキペディア英語版 Partial order reduction In computer science, partial order reduction is a technique for reducing the size of the state-space to be searched by a model checking algorithm. It exploits the commutativity of concurrently executed transitions, which result in the same state when executed in different orders. In explicit state space exploration, partial order reduction usually refers to the specific technique of expanding a representative subset of all enabled transitions. This technique has also been described as model checking with representatives . There are various versions of the method, the so-called stubborn set method , ample set method , and persistent set method . == Ample sets == Ample sets are an example of model checking with representatives. Their formulation relies on a separate notion of ''dependency''. Two transitions are considered independent only if whenever they are mutually enabled, they cannot disable another and the execution of both results in a unique state regardless of the order in which they are executed. Transitions that are not independent, are dependent. In practice dependency is approximated using static analysis. Ample sets for different purposes can be defined by giving conditions as to when a set of transitions is "ample" in a given state. C0 $\backslash iff$ C1 If a transition $\backslash alpha$ depends on some transition relation in $ample(s)$, this transition cannot be invoked until some transition in the ample set is executed. Conditions C0 and C1 are sufficient for preserving all the deadlocks in the state space. Further restrictions are needed in order to preserve more nuanced properties. For instance, in order to preserve properties of linear temporal logic, the following two conditions are needed: C2 If $enabled(s)\; \backslash neq\; ample(s)$, each transition in the ample set is invisible C3 A cycle is not allowed if it contains a state in which some transition $\backslash alpha$ is enabled, but is never included in ample(s) for any states s on the cycle. These conditions are sufficient for an ample set, but not necessary conditions . 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Partial order reduction」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.